Establishing Strong Connectivity using Optimal Radius Half-Disk Antennas
نویسندگان
چکیده
Given a set S of points in the plane representing wireless devices, each point equipped with a directional antenna of radius r and aperture angle α ≥ 180◦, our goal is to find orientations and a minimum r for these antennas such that the induced communication graph is strongly connected. We show that r = √ 3 suffices to establish strong connectivity, assuming that the longest edge in the Euclidean minimum spanning tree for S is 1. This result is optimal in the sense that r = √ 3 is necessary in the worst-case for α ∈ [180◦, 240◦). In contrast, r = 2 is sometimes necessary when α < 180◦.
منابع مشابه
Optimal Orientation of Symmetric Directional Antennas
In this paper, we study the problem of optimal orientation of directional antennas in the symmetric model of communication. We propose an optimal algorithm to find the minimum radius and the orientation of antennas, when antennas are placed on a set P of points on a line, and each antenna has angle less than π. We show that the connected graph induced by this optimal orientation is a 7-hop span...
متن کاملConnectivity of Graphs Induced by Directional Antennas
This paper addresses the problem of finding an orientation and a minimum radius for directional antennas of a fixed angle placed at the points of a planar set S, that induce a strongly connected communication graph. We consider problem instances in which antenna angles are fixed at 90◦ and 180◦, and establish upper and lower bounds for the minimum radius necessary to guarantee strong connectivi...
متن کاملEstablishing Strong Connectivity using Optimal
7 Given a set S of points in the plane representing wireless devices,8each point equipped with a directional antenna of radius r and aperture9angle α ≥ 180◦, our goal is to find orientations and a minimum r for10these antennas such that the induced communication graph is strongly11connected. We show that r =√3 if α ∈ [180◦, 240◦), r =√2 if α ∈...
متن کاملSpanning Properties of graphs induced by Directional Antennas
Let S be a set of points in the plane, whose unit disk graph is connected. We address the problem of finding orientations and a minimum radius for directional antennas of a fixed cone angle placed at the points of S, such that the induced communication graph G[S] is a hop t-spanner (meaning that G[S] is strongly connected, and contains a directed path with at most t edges between any pair of po...
متن کاملEstablishing symmetric connectivity in directional wireless sensor networks equipped with 2π/3 antennas
In this paper, we study the antenna orientation problem concerning symmetric connectivity in directional wireless sensor networks. We are given a set of nodes each of which is equipped with one directional antenna with beam-width θ = 2π/3 and is initially assigned a transmission range 1 that yields a connected unit disk graph spanning all nodes. The objective of the problem is to compute an ori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 46 شماره
صفحات -
تاریخ انتشار 2011